Interactive Consistency Algorithms based on Voting and Error-correcting Codes

This paper presents a new class of synchronous deterministic non-authenticated algorithms for reaching interactive consistency (Byzantine agreement). The algorithms are based on voting and error-correcting codes and require considerably less data communication than the original algorithm, whereas the number of rounds and the number of modules meet the minimum bounds. These algorithm based on voting and coding will be de ned and proved on the basis of a class of algorithms, called the Dispersed Joined Communication algorithms.